On sufficient conditions for expressibility of constants in the 4-valued extension of the propositional provability logic $GL$
نویسنده
چکیده
In the present paper we consider the simplest non-classical extension GL4 of the well-known propositional provability logic GL together with the notion of expressibility of formulas in a logic proposed by A. V. Kuznetsov. Conditions for expressibility of constants in GL4 are found out, which were first announced in a author’s paper in 1996.
منابع مشابه
Infinitely many precomplete with respect to parametric expressibility classes of formulas in a provability logic of propositions
In the present paper we consider a non-tabular extension L of the well-known propositional provability logic GL together with the notion of parametric expressibility of formulas in a logic proposed by A. V. Kuznetsov. We prove that there are infinitely many precomplete with respect to parametric expressibility classes of formulas in the above mentioned logic L.
متن کاملEmbeddings of Propositional Monomodal Logics
The aim of this paper is to investigate the expressibility of classical propositional monomodal logics. To this end, a notion of embedding of one logic into another is introduced, which is, roughly, a translation preserving theoremhood. This enables to measure the expressibility of a logic by a (finite or infinite) number of logics embeddable into it. This measure is calculated here for a large...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملAnother extension of Basic Logic
Basic propositional logic was first introduced by Albert Visser in [6]. Basic logic is a proper subsystem of intuitionistic logic, and can be constructed from it by a weakening of modus ponens. This weakening allows for a larger collection of theories, for example formal provability logic. Formal provability logic is related to the provability modal logic GL just as intuitionistic logic is rela...
متن کاملThe decision problem of provability logic with only one atom
The decision problem for provability logic remains PSPACE -complete even if the number of propositional atoms is restricted to one. In some cases the set of all tautologies of a modal logic is in coNP. An example of a logic like that is the well-known S5. However, most of the traditional modal systems, including S4 and T, have PSPACE -complete decision problem. So one can say that adding modali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1312.0714 شماره
صفحات -
تاریخ انتشار 2013